On approximating thed-girth of a graph
نویسندگان
چکیده
منابع مشابه
On Approximating the d-Girth of a Graph
For a finite, simple, undirected graph G and an integer d ≥ 1, a mindeg-d subgraph is a subgraph of G of minimum degree at least d. The dgirth of G, denoted gd(G), is the minimum size of a mindeg-d subgraph of G. It is a natural generalization of the usual girth, which coincides with the 2-girth. The notion of d-girth was proposed by Erdős et al. [13, 14] and Bollobás and Brightwell [7] over 20...
متن کاملOn the girth of the annihilating-ideal graph of a commutative ring
The annihilating-ideal graph of a commutative ring $R$ is denoted by $AG(R)$, whose vertices are all nonzero ideals of $R$ with nonzero annihilators and two distinct vertices $I$ and $J$ are adjacent if and only if $IJ=0$. In this article, we completely characterize rings $R$ when $gr(AG(R))neq 3$.
متن کاملA Small Trivalent Graph of Girth 14
We construct a graph of order 384, the smallest known trivalent graph of girth 14. AMS Subject Classifications: 05D25, 05D35 In this note we use a construction technique that can be viewed as a kind of generalized Cayley graph. The vertex set V of such a graph consists of the elements in multiple copies of some finite group G. The action of G on V is determined by the regular action on each of ...
متن کاملA trivalent graph of girth 17
A family of trivalent graphs is described that includes most of the known trivalent cages. A new graph in this family is the smallest trivalent graph of girth 17 yet discovered.
متن کاملOn Eigenvalue Multiplicity and the Girth of a Graph
Suppose that G is a connected graph of order n and girth g < n. Let k be the multiplicity of an eigenvalue μ of G. Sharp upper bounds for k are n − g + 2 when μ ∈ {−1, 0}, and n− g otherwise. The graphs attaining these bounds are described.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.04.022